A Propositional Root Antecedent ITMS

نویسندگان

  • Guofu Wu
  • George Macleod Coghill
چکیده

Truth Maintenance Systems (TMSs) are important tools for caching beliefs and inferences that support search and explanation tasks of general problem solvers. For embedded real-time systems, fast response from the TMSs is especially required. To achieve this, Nayak and Williams [9] presented an Incremental Truth Maintenance System (ITMS) based on depth-first numbering to avoid spending a significant percentage of time on calculating labels that remain constant between contexts. However, the goal of incremental context switching is downgraded by the approximate method they chose, because it may miss qualified propositions or even choose the unqualified for resupport; it may also bring the propagation to stop unintentionally. The algorithm based on root antecedents shown in this paper serves exactly the same purpose, while it avoids the problems encountered in Nayak and Williams’ ITMS by adopting a mechanism based on propositional root antecedents that allows constant conclusions to be identified precisely.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comprehension of factual, nonfactual, and counterfactual conditionals by Iranian EFL learners

A considerable amount of studies have been established on conditional reasoning supporting mental model theory of propositional reasoning. Mental model theory proposed by Johnson- larid and Byrne is an explanation of someone's thought process about how something occurs in the real world. Conditional reasoning as a kind of reasoning is the way to speak about possibilities or probabilities. The a...

متن کامل

Propositional Deduction via Sequent Calculus

We have left out negation. We regard ¬φ as a shorthand for φ→ ⊥. A sequent is a pair that packages together some assumptions and a conclusion. We write Γ ` φ for the sequent whose assumptions are the finite set of formulas Γ and whose conclusion is the formula φ. We call Γ the antecedent and φ the consequent of the sequent Γ ` φ. A sequent is satisfied in a model M iff either M |= φ or for some...

متن کامل

Analysis of ITMS System Impact Mechanism in Beijing Based on FD and Traffic Entropy

Although more attention has been attracted to benefit evaluation of Intelligent Transportation Systems ITS deployment, how ITS impact the traffic system and make great effects is little considered. As a subsystem of ITS, in this paper, Intelligent Transportation Management System ITMS is studied with its impact mechanism on the road traffic system. Firstly, the correlative factors between ITMS ...

متن کامل

Dale Jacquette CONUNDRUMS OF CONDITIONALS IN CONTRAPOSITION

A previously unnoticed metalogical paradox about contraposition is formulated in the informal metalanguage of propositional logic, where it exploits a reflexive self-non-application of the truth table definition of the material conditional to achieve semantic diagonalization. Three versions of the paradox are considered. The main modal formulation takes as its assumption a conditional that arti...

متن کامل

Using Closed Sets of Rules for the Entailment of Literals

Entailment that is based on the application of simple production rules, of the form c← a1, . . . , an (n ≥ 0) is weaker than the propositional entailment that would be yielded by translating these rules into material implications. In this paper, we show that rulebased entailment coincides with the propositional entailment of literals, when the set of rules is closed under transposition, transit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004